Large minors in graphs with given independence number
نویسندگان
چکیده
Aweakening of Hadwiger’s conjecture states that every n-vertex graphwith independence number α has a clique minor of size at least n α . Extending ideas of Fox (2010) [6], we prove that such a graph has a clique minor with at least n (2−c)α vertices where c > 1/19.2. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
Large Minors in Graphs with a given Stability Number
A weakening of Hadwiger’s Conjecture states that every n-vertex graph with independence number α has a clique minor of size at least n α . Extending ideas of Fox [6], we prove that such a graph has a clique minor with at least n (2−c)α vertices where c > 1/19.2.
متن کاملForcing large complete minors in infinite graphs
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملOperations which preserve path-width at most two
The number of excluded minors for the graphs with path-width at most two is too large. To give a practical characterization of the obstructions for path-width at most two, we introduce the concept reducibility. We describe some operations, which preserve path-width at most two, and reduce the excluded minors to smaller graphs. In this sense, there are ten graphs which are non-reducible and obst...
متن کاملInterval minors of complete bipartite graphs
Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in Kr,s-interval minor free bipartite graphs. We determine exact values when r = 2 and describe the extremal graphs. For r = 3, lower and upper bounds are given and the structure of K3,s-interval minor free graphs is studied.
متن کاملForcing Large Complete (Topological) Minors in Infinite Graphs
It is well known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalize the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011